Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Permutation")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3232

  • Page / 130
Export

Selection :

  • and

Computing the cycles in the perfect shuffle permutationELLIS, John; KRAHN, Tobias; HONGBING FAN et al.Information processing letters. 2000, Vol 75, Num 5, pp 217-224, issn 0020-0190Article

CODING WITH PERMUTATIONSBLAKE IF; COHEN G; DEZA M et al.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 1; PP. 1-19; BIBL. 26 REF.Article

GROUPES DE PERMUTATIONS ET CODAGECOHEN G; GODLEWSKI P.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 3-4; PP. 347-350; BIBL. 11 REF.Article

RANK 3 GROUPS AND BIPLANES.CAMERON PJ; KANTOR WM.1978; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 1-23; BIBL. 31 REF.Article

THE KRONECKER POWER OF A PERMUTATION.MERRIS R.1976; J. RES. NATION. BUR. STAND., B; U.S.A.; DA. 1976; VOL. 80; NO 2; PP. 265-268; BIBL. 7 REF.Article

Permutations and Riemann surfacesSTAHL, S.Journal of combinatorial theory. Series A. 1984, Vol 36, Num 2, pp 237-239, issn 0097-3165Article

A combinatorial analog of the Jordan curve theoremSTAHL, S.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 1, pp 28-38, issn 0095-8956Article

Restricted even permutations and Chebyshev polynomialsMANSOUR, Toufik.Discrete mathematics. 2006, Vol 306, Num 12, pp 1161-1176, issn 0012-365X, 16 p.Article

Simple permutations : Decidability and unavoidable substructuresBRIGNALL, Robert; RUSKUC, Nik; VATTER, Vincent et al.Theoretical computer science. 2008, Vol 391, Num 1-2, pp 150-163, issn 0304-3975, 14 p.Conference Paper

Permutation importance: a corrected feature importance measureALTMANN, André; TOLOSI, Laura; SANDER, Oliver et al.Bioinformatics (Oxford. Print). 2010, Vol 26, Num 10, pp 1340-1347, issn 1367-4803, 8 p.Article

Common Intervals of Multiple PermutationsHEBER, Steffen; MAYR, Richard; STOYE, Jens et al.Algorithmica. 2011, Vol 60, Num 2, pp 175-206, issn 0178-4617, 32 p.Article

Non-cryptographic primitive for pseudorandom permutationIWATA, Tetsu; YOSHINO, Tomonobu; KUROSAWA, Kaoru et al.Theoretical computer science. 2003, Vol 306, Num 1-3, pp 139-154, issn 0304-3975, 16 p.Article

Almost avoiding permutationsBRIGNALL, Robert; EKHAD, Shalosh B; SMITH, Rebecca et al.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6626-6631, issn 0012-365X, 6 p.Article

Quantum advantage in transmitting a permutationVON KORFF, Joshua; KEMPE, Julia.Physical review letters. 2004, Vol 93, Num 26, pp 260502.1-260502.4, issn 0031-9007, 1Article

Symplectic spreads and permutation polynomialsBALL, Simeon; ZIEVE, Michael.Lecture notes in computer science. 2004, pp 79-88, issn 0302-9743, isbn 3-540-21324-4, 10 p.Conference Paper

Sur les représentations des permutations impaires = On representations of odd permutationsMACHI, A.European journal of combinatorics. 1992, Vol 13, Num 4, pp 273-277, issn 0195-6698Article

Restricted signed permutations counted by the Schröder numbersEGGE, Eric S.Discrete mathematics. 2006, Vol 306, Num 6, pp 552-563, issn 0012-365X, 12 p.Article

Avoiding consecutive patterns in permutationsALDRED, R. E. L; ATKINSON, M. D; MCCAUGHAN, D. J et al.Advances in applied mathematics (Print). 2010, Vol 45, Num 3, pp 449-461, issn 0196-8858, 13 p.Article

Using the Entringer numbers to count the alternating permutations according a new parameterPOUPARD, Christiane.Annales de l'ISUP. 2000, Vol 44, Num 2-3, pp 73-86, issn 1626-1607Article

Finite transition matrices for permutations avoiding pairs of length four patternsKREMERA, Darla; WAI CHEE SHIU.Discrete mathematics. 2003, Vol 268, Num 1-3, pp 171-183, issn 0012-365X, 13 p.Article

Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutationTSABAN, Boaz.Journal of algorithms (Print). 2003, Vol 47, Num 2, pp 104-121, issn 0196-6774, 18 p.Article

The permutation enumeration of wreath products Ck <pilcrow> Sn of cyclic and symmetric groupsWAGNER, Jennifer D.Advances in applied mathematics (Print). 2003, Vol 30, Num 1-2, pp 343-368, issn 0196-8858, 26 p.Conference Paper

Restricted permutations and the wreath productATKINSON, M. D; STITT, T.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 19-36, issn 0012-365X, 18 p.Article

Notes on shuffle/exchange type permutation setsSHING-TSAAN HUANG.IEEE transactions on computers. 1990, Vol 39, Num 7, pp 962-965, issn 0018-9340, 4 p.Article

NOTE ON PRIMITIVE PERMUTATION GROUPS AND A DIOPHANTINE EQUATIONHENSTRIDGE JD; PRAEGER CE.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 2; PP. 181-183; BIBL. 11 REF.Article

  • Page / 130